Asymptotic Properties of Collective-Rearrangement Algorithms
نویسندگان
چکیده
منابع مشابه
Asymptotic Properties of Collective - Rearrangement Algorithms
We analyze asymptotic properties of collective-rearrangement algorithms being a class of dense packing algorithms. Traditionally, they transform finite systems of (possibly overlapping) particles into non-overlapping configurations by collective rearrangement of particles in finitely many steps. We consider the convergence of such algorithms for not necessarily finite input data, which means th...
متن کاملAsymptotic Properties of Proportional-Fair Sharing Algorithms
We are concerned with the allocation of channel or transmitter resources for time varying mobile communications. There are many users who are competing to transmit data over the resource. Time is divided into small scheduling intervals, and information on the channel rates for the various users is available at the start of the intervals. Since the rates vary randomly, there is a conflict at any...
متن کاملAsymptotic Convergence Properties of EM Type Algorithms
We analyze the asymptotic convergence properties of a general class of EM type algorithms for es timating an unknown parameter via alternating estimation and maximization As examples this class includes ML EM penalized ML EM Green s OSL EM and many other approximate EM al gorithms A theorem is given which provides conditions for monotone convergence with respect to a given norm and speci es an ...
متن کاملAsymptotic properties of sign algorithms for adaptive filtering
This paper develops asymptotic properties of a class of sign-error algorithms with expanding truncation bounds for adaptive filtering. Under merely stationary ergodicity and finite second moments of the reference and output signals, and using trajectory-subsequence (TS) method, it is proved that the algorithm convergers almost surely. Then, a mean squares estimate is derived for the estimation ...
متن کاملGenome rearrangement algorithms
With the increasing amount of sequenced genomes, a comparison of species based on these data becomes more and more interesting. In contrast to the classical approach, where only point mutations were considered, genome rearrangement problems ignore small mutations and only consider large-scale mutations that change the gene order on the chromosomes. This makes these problems a powerful tool when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Probability and Statistics
سال: 2015
ISSN: 1292-8100,1262-3318
DOI: 10.1051/ps/2014026